Linear-time algorithms for problems on planar graphs with fixed disk dimensionABU-KHZAM, Faisal N; LANGSTON, Michael A.Information processing letters. 2007, Vol 101, Num 1, pp 36-40, issn 0020-0190, 5 p.Article

Edge dominating set : Efficient enumeration-based exact algorithmsFERNAU, Henning.Lecture notes in computer science. 2006, pp 142-153, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

Randomized approximations of parameterized counting problemsMÜLLER, Moritz.Lecture notes in computer science. 2006, pp 50-59, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 10 p.Conference Paper

The cluster editing problem : Implementations and experimentsDEHNE, Frank; LANGSTON, Michael A; XUEMEI LUO et al.Lecture notes in computer science. 2006, pp 13-24, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

Graph coloring and the immersion orderABU-KHZAM, Faisal N; LANGSTON, Michael A.Lecture notes in computer science. 2003, pp 394-403, issn 0302-9743, isbn 3-540-40534-8, 10 p.Conference Paper

Ontological discovery environment: A system for integrating gene-phenotype associationsBAKER, Erich J; JAY, Jeremy J; PHILIP, Vivek M et al.Genomics (San Diego, Calif.). 2009, Vol 94, Num 6, pp 377-387, issn 0888-7543, 11 p.Article

A direct algorithm for the parameterized face cover problemABU-KHZAM, Faisal N; LANGSTON, Michael A.Lecture notes in computer science. 2004, pp 213-222, issn 0302-9743, isbn 3-540-23071-8, 10 p.Conference Paper

Complex trait analysis of gene expression uncovers polygenic and pleiotropic networks that modulate nervous system functionCHESLER, Elissa J; LU LU; THREADGILL, David W et al.Nature genetics. 2005, Vol 37, Num 3, pp 233-242, issn 1061-4036, 10 p.Article

Quadratic Kernelization for Convex Recoloring of TreesBODLAENDER, Hans L; FELLOWS, Michael R; LANGSTON, Michael A et al.Algorithmica. 2011, Vol 61, Num 2, pp 362-388, issn 0178-4617, 27 p.Article

A network-based analysis of the late-phase reaction of the skinBENSON, Mikael; LANGSTON, Michael A; ADNER, Mikael et al.Journal of allergy and clinical immunology. 2006, Vol 118, Num 1, pp 220-225, issn 0091-6749, 6 p.Article

An exact algorithm for the minimum dominating clique problemKRATSCH, Dieter; LIEDLOFF, Mathieu.Lecture notes in computer science. 2006, pp 130-141, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

The lost continent of polynomial time : Preprocessing and kernelizationFELLOWS, Michael R.Lecture notes in computer science. 2006, pp 276-277, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 2 p.Conference Paper

Fixed-parameter approximation : Conceptual framework and approximability resultsLIMING CAI; XIUZHEN HUANG.Lecture notes in computer science. 2006, pp 96-108, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 13 p.Conference Paper

Fixed parameter tractability of independent set in segment intersection graphsKARA, Jan; KRATOCHVIL, Jan.Lecture notes in computer science. 2006, pp 166-174, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 9 p.Conference Paper

On the OBDD size for graphs of bounded tree-and clique-widthMEER, Klaus; RAUTENBACH, Dieter.Lecture notes in computer science. 2006, pp 72-83, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

The parameterized complexity of maximality and minimality problemsYIJIA CHEN; FLUM, Jörg.Lecture notes in computer science. 2006, pp 25-37, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 13 p.Conference Paper

Parameterized approximation problemsDOWNEY, Rodney G; FELLOWS, Michael R; MCCARTIN, Catherine et al.Lecture notes in computer science. 2006, pp 121-129, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 9 p.Conference Paper

Parameterizing MAX SNP problems above guaranteed valuesMAHAJAN, Meena; RAMAN, Venkatesh; SIKDAR, Somnath et al.Lecture notes in computer science. 2006, pp 38-49, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

Random separation : A new method for solving fixed-cardinality optimization problemsLEIZHEN CAI; SIU MAN CHAN; SIU ON CHAN et al.Lecture notes in computer science. 2006, pp 239-250, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

Kernels : Annotated, proper and inducedABU-KHZAM, Faisal N; FERNAU, Henning.Lecture notes in computer science. 2006, pp 264-275, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

Applying modular decomposition to parameterized bicluster editingPROTTI, Fabio; DANTAS DA SILVA, Maise; SZWARCFITER, Jayme Luiz et al.Lecture notes in computer science. 2006, pp 1-12, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

The parameterized complexity of enumerating frequent itemsetsHAMILTON, Matthew; CHAYTOR, Rhonda; WAREHAM, Todd et al.Lecture notes in computer science. 2006, pp 227-238, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

Towards a taxonomy of techniques for designing parameterized algorithmsSLOPER, Christian; TELLE, Jan Arne.Lecture notes in computer science. 2006, pp 251-263, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 13 p.Conference Paper

Fixed-parameter tractability results for full-degree spanning tree and its dualJIONG GUO; NIEDERMEIER, Rolf; WERNICKE, Sebastian et al.Lecture notes in computer science. 2006, pp 203-214, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

On the parameterized complexity of d-dimensional point set pattern matchingCABELLO, Sergio; GIANNOPOULOS, Panos; KNAUER, Christian et al.Lecture notes in computer science. 2006, pp 175-183, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 9 p.Conference Paper